Extension of Watson crick fuzzy automaton based on topological features
نویسندگان
چکیده
Traditional Fuzzy Automata are not sufficient to model complex real life applications such as biomedical systems where the inputs can be in terms of Fuzzy. Watson Crick Finite Automaton, which works on Double Stranded tapes was introduced a computational analyze DNA molecule for purpose. The concept Fuzziness and studied theory Automaton. thought an effective computing with problems having incomplete knowledge Vagueness. In order efficiently handle Uncertainty theory, here this research paper, extended by incorporating concepts inputs. notion Automaton has plenty real-life situations several domains. transition map extension is done. languages accepted studied. idea Strong Successor operator discussed. Further, Source operations also its characterizations detail. Finally, Cartesian product established.
منابع مشابه
Some Remarks on Superposition Based on Watson-Crick-Like Complementarity
In this note we solve a problem left open in [2]: namely, we show that the iterated superposition of a regular language is regular. The proof of this result is based on two facts: (i) the iterated superposition of a language equals the restricted iterated superposition of the same language, (ii) the sequence formed by iteratively applying the restricted superposition can be precisely defined. W...
متن کاملWatson-Crick D0L Systems
D0L systems constitute the simplest and most widely studied type of Lindenmayer systems. They have the remarkable property of generating their language as a (word) sequence and, consequently, are very suitable for modeling growth properties. In this paper a new type of D0L systems is introduced, where the parallelism presented in L systems is combined with the paradigm of (Watson-Crick) complem...
متن کاملRestricted deterministic Watson-Crick automata
In this paper, we introduce a new model of deterministic Watson-Crick automaton namely restricted deterministic WatsonCrick automaton which is a deterministic Watson-Crick automaton where the complementarity string in the lower strand is restricted to a language L. We examine the computational power of the restricted model with respect to L being in different language classes such as regular, u...
متن کاملA Short Survey on Watson-Crick Automata
This paper surveys some known results in Watson-Crick automata theory. In particular, we concentrate on the computational power, complexity measures, decidability problems, and systems of Watson-Crick automata working together on the same input. This selection of topics is not exhaustive, reflecting the research interests of the authors. A series of open problems and questions is also included.
متن کاملMulti-head Watson-Crick automata
Inspired by multi-head finite automata and Watson-Crick automata in this paper, we introduce a new structure namely multi-head Watson-Crick automata where we replace the single tape of multi-head finite automaton by a DNA double strand. The content of the second tape is determined using a complementarity relation similar to Watson-Crick complementarity relation. We establish the superiority of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nucleation and Atmospheric Aerosols
سال: 2022
ISSN: ['0094-243X', '1551-7616', '1935-0465']
DOI: https://doi.org/10.1063/5.0103763